MetiTarski: An Automatic Prover for the Elementary Functions
نویسندگان
چکیده
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision procedure (QEPCAD) for the theory of real closed fields. The decision procedure simplifies clauses by deleting literals that are inconsistent with other algebraic facts, while deleting as redundant clauses that follow algebraically from other clauses. MetiTarski includes special code to simplify arithmetic expressions.
منابع مشابه
MetiTarski's Menagerie of Cooperating Systems
MetiTarski, an automatic theorem prover for real-valued special functions, is briefly introduced. Its architecture is sketched, with a focus on the arithmetic reasoning systems that it invokes. Finally, the paper describes some applications where MetiTarski is itself invoked by other tools.
متن کاملMetiTarski: Past and Future
A brief overview is presented of MetiTarski [4], an automatic theorem prover for real-valued special functions: ln, exp, sin, cos, etc. MetiTarski operates through a unique interaction between decision procedures and resolution theorem proving. Its history is briefly outlined, along with current projects. A simple collision avoidance example is presented.
متن کاملApplications of MetiTarski in the Verification of Control and Hybrid Systems
MetiTarski, an automatic proof procedure for inequalities on elementary functions, can be used to verify control and hybrid systems. We perform a stability analysis of control systems using Nichols plots, presenting an inverted pendulum and a magnetic disk drive reader system. Given a hybrid systems specified by a system of differential equations, we use Maple to obtain a problem involving the ...
متن کاملAutomated Real Proving in PVS via MetiTarski
This paper reports the development of a proof strategy that integrates the MetiTarski theorem prover as a trusted external decision procedure into the PVS theorem prover. The strategy automatically discharges PVS sequents containing real-valued formulas, including transcendental and special functions, by translating the sequents into first order formulas and submitting them to MetiTarski. The n...
متن کاملAutomatic Proof Procedures for Polynomials and Special Functions
The key prior items of work are the MetiTarski theorem prover (Cambridge) and the RAHD decision procedure (Edinburgh). RAHD1 is a proof procedure for polynomials over the reals, and MetiTarski additionally is tailored for handling special functions such as log, exp, sin and cos. Both systems are well beyond the first prototype stage, and both have already shown world-leading characteristics [1,...
متن کامل